Markov Chain Monte Carlo With Mixtures of Mutually Singular Distributions
نویسندگان
چکیده
Markov chain Monte Carlo (MCMC) methods for Bayesian computation are mostly used when the dominating measure is the Lebesgue measure, the counting measure, or a product of these. Many Bayesian problems give rise to distributions that are not dominated by the Lebesgue measure or the counting measure alone. In this article we introduce a simple framework for using MCMC algorithms in Bayesian computation with mixtures of mutually singular distributions. The idea is to find a common dominating measure that allows the use of traditional Metropolis–Hastings algorithms. In particular, using our formulation, the Gibbs sampler can be used whenever the full conditionals are available. We compare our formulation with the reversible jump approach and show that the two are closely related. We give results for three examples, involving testing a normal mean, variable selection in regression, and hypothesis testing for differential gene expression under multiple conditions. This allows us to compare the three methods considered: Metropolis–Hastings with mutually singular distributions, Gibbs sampler with mutually singular distributions, and reversible jump. In our examples, we found the Gibbs sampler to be more precise and to need considerably less computer time than the other methods. In addition, the full conditionals used in the Gibbs sampler can be used to further improve the estimates of the model posterior probabilities via Rao–Blackwellization, at no extra cost.
منابع مشابه
Markov chain Monte Carlo with mixtures of singular distributions
Markov chain Monte Carlo (MCMC) methods for Bayesian computation are mostly used when the dominating measure is the Lebesgue measure, the counting measure or a product of these. Many Bayesian problems give rise to distributions that are not dominated by the Lebesgue measure or the counting measure alone. In this paper, we introduce a simple framework for using MCMC algorithms in Bayesian comput...
متن کاملReversible jump, birth-and-death and more general continuous time Markov chain Monte Carlo samplers
Reversible jump methods are the most commonly used Markov chain Monte Carlo tool for exploring variable dimension statistical models. Recently, however, an alternative approach based on birth-and-death processes has been proposed by Stephens for mixtures of distributions.We show that the birth-and-death setting can be generalized to include other types of continuous time jumps like split-and-co...
متن کاملA Study of Skewed Heavy-tailed Distributions as Scale Mixtures
In this paper, we study and compare different proposals of heavy-tailed (possibly skewed) distributions as robust alternatives to the normal model. The density functions are all represented as scale mixtures which enables efficient Bayesian estimation via Markov chain Monte Carlo (MCMC) methods. However, while the symmetric versions of these distributions are able to model heavy tails they of c...
متن کاملSpatial count models on the number of unhealthy days in Tehran
Spatial count data is usually found in most sciences such as environmental science, meteorology, geology and medicine. Spatial generalized linear models based on poisson (poisson-lognormal spatial model) and binomial (binomial-logitnormal spatial model) distributions are often used to analyze discrete count data in which spatial correlation is observed. The likelihood function of these models i...
متن کاملA Bayesian Analysis of Hierarchical Mixtures with Application to Clustering Fingerprints
Hierarchical mixture models arise naturally for clustering a heterogeneous population of objects where observations made on each object follow a standard mixture density. Hierarchical mixtures utilize complementary aspects of mixtures at different levels of the hierarchy. At the first (top) level, the mixture is used to perform clustering of the objects, while at the second level, nested mixtur...
متن کامل